class Solution {
    public int[][] findContinuousSequence(int target) {
        int left = 1, right = 2, sum = 0;
        List<int[]> list = new ArrayList<>();
        while(right <= ((target >> 1) + 1)){
            sum = 0;
            for(int i = left; i <= right; i++){
                sum += i;
            }
            if(sum > target){
                left++;
            } else if(sum < target) {
                right++;
            } else {
                int[] arr = new int[right - left + 1];
                int index = 0;
                for(int i = left; i <= right; i++){
                    arr[index++] = i;
                }
                list.add(arr);
                right++;
            }
        }
        int[][] res = new int[list.size()][];
        for(int i = 0; i < list.size(); i++){
            res[i] = list.get(i);
        }
        return res;
    }
}